Adaptive parallel I/O scheduling algorithm for multiprogrammed systems
نویسنده
چکیده
As the rate at which disk drives read and write data is improving at a much slower pace than the speed of processors, I/O has risen to become the bottleneck in high-performance computing for many applications. A possible approach to address this problem is to schedule parallel I/O operations explicitly. To this end, we propose two new I/O scheduling algorithms and evaluate the relative performance of the proposed policies against two baseline policies. Simulation results show that the proposed policies outperform the baseline policies. © 2005 Published by Elsevier B.V.
منابع مشابه
Probablistic Self-Scheduling
Scheduling for large parallel systems such as clusters and grids presents new challenges due to multiprogramming/polyprocessing [1]. In such systems, several jobs (each consisting of a number of parallel tasks) of multiple users may run at the same time. Processors are allocated to the different jobs either statically or dynamically; further, a processor may be taken away from a task of one job...
متن کاملASP: Adaptive online parallel disk scheduling
In this work we address the problems of prefetchingand I/O scheduling for read-once reference strings in a parallel I/O system. We use the standard parallel disk model withD disks a shared I/O bu er of sizeM . We design an on-line algorithm ASP (Adaptive Segmented Prefetching) with ML-block lookahead, L 1, and compare its performance to the best on-line algorithm with the same lookahead. We sho...
متن کاملParallel Jobs Scheduling with a Specific Due Date: Asemi-definite Relaxation-based Algorithm
This paper considers a different version of the parallel machines scheduling problem in which the parallel jobs simultaneously requirea pre-specifiedjob-dependent number of machines when being processed.This relaxation departs from one of the classic scheduling assumptions. While the analytical conditions can be easily statedfor some simple models, a graph model approach is required when confli...
متن کاملParallel Generation of t-ary Trees
A parallel algorithm for generating t-ary tree sequences in reverse B-order is presented. The algorithm generates t-ary trees by 0-1 sequences, and each 0-1 sequences is generated in constant average time O(1). The algorithm is executed on a CREW SM SIMD model, and is adaptive and cost-optimal. Prior to the discussion of the parallel algorithm a new sequential generation with O(1) average time ...
متن کاملApplication Scheduling and Processor Allocation in Multiprogrammed Parallel Processing Systems
When large-scale multiprocessors for parallel processing are subjected to heavy diverse workloads of applications, it will be necessary to schedule them in a multiprogrammed fashion in order to use the system resources effectively and keep response times low. Information about the characteristics of individual applications can be used to achieve effective scheduling. We identify some useful par...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Future Generation Comp. Syst.
دوره 22 شماره
صفحات -
تاریخ انتشار 2006